0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : purification_int
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.01	#!/bin/sh
0.00/0.01	
0.00/0.01	./zipperposition.native ${1:+"$1"} \
0.00/0.01	  -i tptp \
0.00/0.01	  -o tptp \
0.00/0.01	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.01	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.01	  --no-avatar \
0.00/0.01	  --ho \
0.00/0.01	  --force-ho \
0.00/0.01	  --no-ho-elim-pred-var \
0.00/0.01	  --ho-general-ext-pos \
0.00/0.01	  --no-ho-unif \
0.00/0.01	  --no-induction \
0.00/0.01	  --no-unif-pattern \
0.00/0.01	  --ord $2  \
0.00/0.01	  --simultaneous-sup false \
0.00/0.01	  --ho-purify int \
0.00/0.01	  --ho-no-ext-pos \
0.00/0.01	  --ho-no-ext-neg \
0.00/0.01	  --ho-prim-enum none \
0.00/0.01	  --no-max-vars \
0.00/0.01	  --dont-select-ho-var-lits \
0.00/0.01	  --no-fool
0.00/0.27	% Computer   : n091.star.cs.uiowa.edu
0.00/0.27	% Model      : x86_64 x86_64
0.00/0.27	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.27	% Memory     : 32218.625MB
0.00/0.27	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.27	% CPULimit   : 300
0.00/0.27	% DateTime   : Fri Feb  2 06:21:23 CST 2018
0.00/0.28	% done 7 iterations in 0.003s
0.00/0.28	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.28	% SZS output start Refutation
0.00/0.28	tff(satz10e, axiom, (![Xx:nat,Xy:nat]: ((~more(Xx,Xy)) => lessis(Xx,Xy)))).
0.00/0.28	tff('0', plain, ![X0 : nat, X1 : nat]: (lessis(X0, X1) | more(X0, X1)),
0.00/0.28	    inference('cnf', [status(esa)], [satz10e])).
0.00/0.28	tff(l, axiom, (less(y,pl(x,n_1)))).
0.00/0.28	tff('1', plain, less(y, pl(x, n_1)), inference('cnf', [status(esa)], [l])).
0.00/0.28	tff(satz25, axiom,
0.00/0.28	  (![Xx:nat,Xy:nat]: (more(Xy,Xx) => moreis(Xy,pl(Xx,n_1))))).
0.00/0.28	tff('2', plain,
0.00/0.28	    ![X4 : nat, X5 : nat]: (moreis(X4, pl(X5, n_1)) | ~ more(X4, X5)),
0.00/0.28	    inference('cnf', [status(esa)], [satz25])).
0.00/0.28	tff(satz10h, axiom, (![Xx:nat,Xy:nat]: (less(Xx,Xy) => (~moreis(Xx,Xy))))).
0.00/0.28	tff('3', plain, ![X2 : nat, X3 : nat]: (~ moreis(X2, X3) | ~ less(X2, X3)),
0.00/0.28	    inference('cnf', [status(esa)], [satz10h])).
0.00/0.28	tff('4', plain,
0.00/0.28	    ![X0 : nat, X1 : nat]:
0.00/0.28	      (~ $true | ~ more(X1, X0) | ~ less(X1, pl(X0, n_1))),
0.00/0.28	    inference('sup-', [status(thm)], ['2', '3'])).
0.00/0.28	tff('5', plain,
0.00/0.28	    ![X0 : nat, X1 : nat]: (~ less(X1, pl(X0, n_1)) | ~ more(X1, X0)),
0.00/0.28	    inference('simplify', [status(thm)], ['4'])).
0.00/0.28	tff('6', plain, (~ $true | ~ more(y, x)),
0.00/0.28	    inference('sup-', [status(thm)], ['1', '5'])).
0.00/0.28	tff('7', plain, ~ more(y, x), inference('simplify', [status(thm)], ['6'])).
0.00/0.28	tff('8', plain, (~ $true | lessis(y, x)),
0.00/0.28	    inference('sup-', [status(thm)], ['0', '7'])).
0.00/0.28	tff('9', plain, lessis(y, x), inference('simplify', [status(thm)], ['8'])).
0.00/0.28	tff(satz26, conjecture, (lessis(y,x))).
0.00/0.28	tff(zf_stmt_0, negated_conjecture, (~lessis(y,x))).
0.00/0.28	tff('10', plain, ~ lessis(y, x), inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.28	tff('11', plain, ~ $true, inference('sup-', [status(thm)], ['9', '10'])).
0.00/0.28	tff('12', plain, $false, inference('simplify', [status(thm)], ['11'])).
0.00/0.28	
0.00/0.28	% SZS output end Refutation
0.00/0.28	EOF
